Secure Implementation in Queueing Problems

Mechanism Design in Queueing Problems

A well-known result in incentive theory is that for a very broad class of decision problems, there is no mechanism which achieves truthtelling in dominant strategies, efficiency and budget balancedness (or first best implementability). On the contrary, Mitra and Sen (1998), prove that linear cost queueing models are first best implementable. This paper is an attempt at identification of cost st...

No-envy in Queueing Problems

We explore the implications of no-envy (Foley 1967) in the context of queueing problems. We identify an easy way of checking whether a rule satisfies efficiency and no-envy. The existence of such a rule can easily be established. Next, we ask whether there is a rule satisfying efficiency and noenvy together with an additional solidarity requirement: every agent should be affected in the same di...

Emergency Location Problems with an M/G/k Queueing System

  Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...

Explicit Solutions for Queueing Problems

On queueing problems in random-access communications

The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main focus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random a...